Bounded serial-batching scheduling for minimizing maximum lateness and makespan
نویسندگان
چکیده
منابع مشابه
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines
We consider the two-parallel machines scheduling problem, with the aim of minimizing the maximum lateness and the makespan. Formally, the problem is defined as follows. We have to schedule a set J of n jobs on two identical machines. Each job i ∈ J has a processing time pi and a delivery time qi. Each machine can only perform one job at a given time. The machines are available at time t = 0 and...
متن کاملImproved dynamic programs for batching problems with maximum lateness criterion
We study a class of scheduling problems involving the maximum lateness criterion and an element of batching For all the problems that we examine algorithms appear in the literature which consist of a sorting step to determine an optimal job sequence followed by a dynamic programming step which determines the optimal batches In each case the dynamic program is based on a backward recursion of wh...
متن کاملApproximation Algorithm of Minimizing Makespan in Parallel Bounded Batch Scheduling∗
We consider the problem of minimizing the makespan(Cmax) on m identical parallel batch processing machines. The batch processing machine can process up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. For a batch of jobs, the processing time of the batch is equal to the largest processing time among the job...
متن کاملNo-wait flowshops with bicriteria of makespan and maximum lateness
In this work we study a flowshop scheduling problem in which jobs are not allowed to wait in-between machines, a situation commonly referred to as no-wait. The concerned criterion is to minimize a weighted sum of makespan and maximum lateness. A dominance relation for the case of three-machine is presented and evaluated by experimental designs. Several heuristics and local search methods are pr...
متن کاملMinimizing makespan with release times on identical parallel batching machines
We consider the problem of scheduling n jobs onm identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n ) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2015
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2015.02.001